منابع مشابه
Logic Program Synthesis
> This paper presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a speciication, how do we get a logic program satisfying the speciication? Logic programming provides a uniquely nice and uniform framework for program synthesis since the speciication, the synthesis process and...
متن کاملLogic Program Synthesis from Incomplete Specifications
Program synthesis research aims at maximally automating the passage from specifications to programs (see the survey by Biermann, 1992). We define possible formalisms for the starting points (specifications: see Section 1.1) and results (programs: see Section 1.2) of synthesis, and state existing approaches and related work, before pinning down the objectives (Section 1.3) of this paper. Some fa...
متن کاملInductive Logic Program Synthesis with DIALOGS
DIALOGS (Dialog-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and minimally queries a (possibly computationally naive) specifier for evidence in her/his conceptual language. The specifier must know the answers to such simple queries, because otherwise s/he wouldn’t even feel the need for the synthesiz...
متن کاملAnalogical Logic Program Synthesis from Examples
The purpose of this paper is to present a theory and an algorithm for analogical logic program synthesis from examples. Given a source program and examples, the task of our algorithm is to nd a program which explains the examples correctly and is similar to the source program. Although we can de ne a notion of similarity in various ways, we consider a class of similarities from the viewpoint of...
متن کاملAutomatic Program Synthesis in Second-Order Logic
Abetract A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm , has been applied to the automatic synthesis of SN0B0L-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions. Descriptive Terms Higher-order l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1994
ISSN: 0743-1066
DOI: 10.1016/0743-1066(94)90029-9